Bounded model checking of infinite state systems
نویسندگان
چکیده
منابع مشابه
Bounded model checking of infinite state systems
Bounded model checking (BMC) is an attractive alternative to symbolic model checking, since it often allows a more efficient verification. The idea of BMC is to reduce the model checking problem to a satisfiability problem of the underlying base logic, so that sophisticated decision procedures can be utilized to check the resulting formula. We present a new approach to BMC that extends current ...
متن کاملGlobal Model-Checking of Infinite-State Systems
We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Chec...
متن کاملOn Model Checking Infinite-State Systems
This paper presents a proof method for proving that innnite-state systems satisfy properties expressed in the modal-calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Braddeld and Stirling following lines used by Winskel for nite-state systems. Contrary to the tableau method, it avoids the...
متن کاملVerification of Infinite State Systems by Compositional Model Checking
A method of compositional verification is presented that uses the combination of temporal case splitting and data type reductions to reduce types of infinite or unbounded range to small finite types, and arrays of infinite or unbounded size to small fixed-size arrays. This supports the verification by model checking of systems with unbounded resources and uninterpreted functions. The method is ...
متن کاملSymbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
We present a new symbolic model checker which conservatively evaluates safety and liveness properties on innnite-state programs. We use Presburger formulas to symbolically encode a program's transition system, as well as its model-checking computations. All xpoint calculations are executed symbolically, and their convergence is guaranteed by using approximation techniques. We demonstrate the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2006
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-006-0019-9